Automated Verification of Correctness for Masked Arithmetic Programs

Abstract Masking is a widely-used effective countermeasure against power side-channel attacks for implementing cryptographic algorithms. Surprisingly, few formal verification techniques have addressed fundamental question, i.e., whether the masked program and original (unmasked) algorithm are functional equivalent. In this paper, we study problem arithmetic programs over Galois fields of characteristic 2. We propose an automated approach based on term rewriting, aided by random testing SMT solving. The overall sound, complete under certain conditions which do meet in practice. implement as new tool carry out extensive experiments various benchmarks. results confirm effectiveness, efficiency scalability our approach. Almost all benchmarks can be proved first time rewriting system solely. particular, detects flaw implementation published EUROCRYPT 2017.